A workshop on approximation algorithms for combinatorial optimization problems focussing on algorithmic and complexity aspects arising in the development of efficient approximate solutions to computationally difficult problems. It aims, in particular,...

4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2001) and 5th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM 2001). Berkeley, California; August 1...

Research programme at the Isaac Newton Institute, Cambridge UK. Themes include: Randomised algorithms; "Phase transitions" in statistical physics and computer science; Random graphs and structures. August -- December 2002.

9th Annual European Symposium on Algorithms. BRICS, University of Aarhus, Denmark; 28--31 August 2001.

10th European Symposium on Algorithms. Part of Algo'02. University of Rome "La Sapienza", Italy; 17--21 September 2002.

Third international workshop on Implicit Computational Complexity. Co-located with PADO II and MFPS XVII. Aarhus, Denmark; 20--21 May 2001.

12th Annual ACM-SIAM Symposium on Discrete Algorithms. Washington, D.C., USA; 7--9 January 2001.

13th SIAM Symposium on Discrete Algorithms. San Francisco, CA, USA; 6--8 January 2002.

14th ACM-SIAM Symposium on Discrete Algorithms. Hyatt Regency, Baltimore, MD, USA; 12--14 January 2003.

ACM-SIAM Symposium on Discrete Algorithms. New Orleans, LA, USA; 11--13 January 2004.